Smart building uncertainty analysis via adaptive Lasso
نویسندگان
چکیده
منابع مشابه
Smart building uncertainty analysis via adaptive Lasso
Uncertainty analysis plays a pivotal role in identifying the important parameters affecting building energy consumption and estimate their effects at the early design stages. In this work, we consider the adaptive Lasso for uncertainty analysis in building performance simulation. This procedure has several appealing features: (1) We can introduce a large number of possible physical and environm...
متن کاملSubset ARMA selection via the adaptive Lasso
Model selection is a critical aspect of subset autoregressive moving-average (ARMA) modelling. This is commonly done by subset selection methods, which may be computationally intensive and even impractical when the true ARMA orders of the underlying model are high. On the other hand, automatic variable selection methods based on regularization do not directly apply to this problem because the i...
متن کاملModel selection via standard error adjusted adaptive lasso
The adaptive lasso is a model selection method shown to be both consistent in variable selection and asymptotically normal in coefficient estimation. The actual variable selection performance of the adaptive lasso depends on the weight used. It turns out that the weight assignment using the OLS estimate (OLS-adaptive lasso) can result in very poor performance when collinearity of the model matr...
متن کاملAdaptive Group Sparse Multi-task Learning via Trace Lasso
In multi-task learning (MTL), tasks are learned jointly so that information among related tasks is shared and utilized to help improve generalization for each individual task. A major challenge in MTL is how to selectively choose what to share among tasks. Ideally, only related tasks should share information with each other. In this paper, we propose a new MTL method that can adaptively group c...
متن کاملNetwork Exploration via the Adaptive Lasso and Scad Penalties.
Graphical models are frequently used to explore networks, such as genetic networks, among a set of variables. This is usually carried out via exploring the sparsity of the precision matrix of the variables under consideration. Penalized likelihood methods are often used in such explorations. Yet, positive-definiteness constraints of precision matrices make the optimization problem challenging. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Cyber-Physical Systems: Theory & Applications
سال: 2017
ISSN: 2398-3396,2398-3396
DOI: 10.1049/iet-cps.2017.0011